On the Supports of Recognizable Timed Series
نویسنده
چکیده
Recently, the model of weighted timed automata has gained interest within the real-time community. In a previous work, we built a bridge to the theory of weighted automata and introduced a general model of weighted timed automata defined over a semiring and a family of cost functions. In this model, a weighted timed automaton recognizes a timed series, i.e., a function mapping to each timed word a weight taken from the semiring. Continuing in this spirit, the aim of this paper is to investigate the support and cut languages of recognizable timed series. We present results that lead to the decidability of weighted versions of classical decidability problems as e.g. the emptiness problem. Our results may also be used to check whether weighted timed systems satisfy specifications restricting the consumption of a resource.
منابع مشابه
A Kleene-Schützenberger Theorem for Weighted Event-Clock Automata
We present a Kleene-Schützenberger-Theorem for weighted event-clock automata, i.e., we show that the class of recognizable timed series coincides with the class of rational timed series. The result generalizes Kleene’s famous theorem and its extensions to the classes of weighted automata and event-clock automata. For proving the theorem, we use the method of a recent work on the class of weight...
متن کاملOn the supports of recognizable series over a field and a single letter alphabet
We prove that the support of a recognizable series over a field of characteristic zero and a single letter alphabet is recognizable. This provides an answer to a question of Kirsten [4]. Then we give an example of a recognizable series over a field of prime characteristic and a single letter alphabet whose support is not recognizable which provides an answer to a question of Kirsten and Quaas [5].
متن کاملOn Recognizable Timed Languages
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the monoid of timed words into a bounded subset of itself. We show that the recognizable languages are exactly those accepted by deterministic timed automata and argue that this is, perhaps, the right class of timed languag...
متن کاملA Logical Characterization for Weighted Timed Automata
We aim to generalize Büchi’s fundamental theorem on the coincidence of recognizable and MSO-definable languages to a weighted timed setting. For this, we investigate weighted timed automata and show how we can extend Wilke’s relative distance logic with weights taken from an arbitrary semiring. We show that every formula in our logic can effectively be transformed into a weighted timed automato...
متن کاملSelective and stable adhesion of Yeast cells to Boronate-containing Polymer Grafted to glass Supports
A series of sorbents containing various amounts of borate groups were prepared by chemical immobilization ofP-aminoethylphenylboric acid on a copolymer- treated organosilane spacer glass plates. It was found thatbaker's yeast cells selectively adhered to these supports. Yeast cells stained with procion red HE-3B formeddenser and more stable layer on the copolymer-grafted supports compared onto ...
متن کامل